Independence number and connectivity for fractional (<i>a</i>, <i>b</i>, <i>k</i>)-critical covered graphs
نویسندگان
چکیده
A graph G is a fractional ( , b k )-critical covered if − U [ ]-covered for every ⊆ V ) with | = which first defined by (Zhou, Xu and Sun, Inf. Process. Lett. 152 (2019) 105838). Furthermore, they derived degree condition to be graph. In this paper, we gain an independence number connectivity verify that ≥ max {2 +1)( +1)+4 bk +5/4 ,( +1) 2
منابع مشابه
On the independence number of edge chromatic critical graphs
In 1968, Vizing conjectured that for any edge chromatic critical graph G = (V,E) with maximum degree ∆ and independence number α(G), α(G) ≤ |V | 2 . It is known that α(G) < 3∆−2 5∆−2 |V |. In this paper we improve this bound when ∆ ≥ 4. Our precise result depends on the number n2 of 2-vertices in G, but in particular we prove that α(G) ≤ 3∆−3 5∆−3 |V | when ∆ ≥ 5 and n2 ≤ 2(∆− 1).
متن کاملEdge number critical triangle free graphs with low independence numbers
The structure of all triangle free graphs G = (V,E) with |E|−6|V |+α(G) = 0 is determined, yielding an affirmative answer to a question of Stanis law Radziszowsky and Donald Kreher.
متن کاملK-independence Critical Graphs
Let k be a positive integer and G = (V (G), E(G)) a graph. A subset S of V (G) is a k-independent set of G if the subgraph induced by the vertices of S has maximum degree at most k − 1. The maximum cardinality of a k-independent set of G is the k-independence number βk(G). In this paper, we study the properties of graphs for which the k-independence number changes whenever an edge or vertex is ...
متن کاملSome Results on Fractional Covered Graphs∗
Let G = (V (G),E(G)) be a graph. and let g, f be two integer-valued functions defined on V (G) such that g(x)≤ f (x) for all x ∈V (G). G is called fractional (g, f )-covered if each edge e of G belongs to a fractional (g, f )-factor Gh such that h(e) = 1, where h is the indicator function of Gh. In this paper, sufficient conditions related to toughness and isolated toughness for a graph to be f...
متن کاملNotes on Fractional k-Covered Graphs
A graph G is fractional k-covered if for each edge e of G, there exists a fractional k-factor h, such that h(e) = 1. If k = 2, then a fractional k-covered graph is called a fractional 2-covered graph. The binding number bind(G) is defined as follows, bind(G) = min{ |NG(X)| |X| : Ø = X ⊆ V (G), NG(X) = V (G)}. In this paper, it is proved that G is fractional 2-covered if δ(G) ≥ 4 and bind(G) > 5...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rairo-operations Research
سال: 2022
ISSN: ['1290-3868', '0399-0559']
DOI: https://doi.org/10.1051/ro/2022119